Linear BSP Trees for Sets of Hyperrectangles with Low Directional Density
نویسندگان
چکیده
We consider the problem of constructing of binary space partitions (BSP) for a set S of n hyperrectangles in arbitrary dimensional space. If the set S fulfills the low directional density condition defined in this paper then the resultant BSP has O(n) size and it can be constructed in O(n log n) time in R. The low directional density condition defines a new class of objects which we are able to construct a linear BSP for. The method is quite simple and it should be appropriate for practical implementation. keywords: BSP, rectangle, tree, partitioning
منابع مشابه
Linear BSP Trees for Sets of Hyperrectangleswith Low Directional
We consider the problem of constructing of binary space partitions (BSP) for a set S of n hyperrectangles in arbitrary dimensional space. If the set S fulllls the low directional density condition deened in this paper then the resultant BSP has O(n) size and it can be constructed in O(n log 2 n) time in R 3. The low directional density condition deenes a new class of objects which we are able t...
متن کاملLinear BSP Tree in the Plane for Set of Segments with Low Directional Density
We introduce a new BSP tree construction method for set of segments in the plane. Our algorithm is able to create BSP tree of linear size in the time O(n log n) for set of segments with low directional density (i.e. it holds for arbitrary segment si from such set, that a line created as extension of this segment doesn’t intersect too many other segments from the set in a near neighbourhood of s...
متن کاملLinear BSP Tree in the Plane for Set of Segmentswith Low Directional
We introduce a new BSP tree construction method for set of segments in the plane. Our algorithm is able to create BSP tree of linear size in the time O(n log 3 n) for set of segments with low directional density (i.e. it holds for arbitrary segment s i from such set, that a line created as extension of this segment doesn't intersect too many other segments from the set in a near neighbourhood o...
متن کاملExact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms
We prove the following upper and lower bounds on the exact size of binary space partition (BSP) trees for a set of n isothetic rectangles in the plane: • An upper bound of 3n− 1 in general, and an upper bound of 2n− 1 if the rectangles tile the underlying space. This improves the upper bounds of 4n in [V. Hai Nguyen and P. Widmayer, Binary Space Partitions for Sets of Hyperrectangles, Lecture N...
متن کاملRectilinear Bsp Trees for Preferred Ray Sets
Rectilinear Binary Space Partitioning (BSP) trees are often used for solving various types of range searching problems including ray shooting. We propose a novel method for construction of rectilinear BSP trees for a preferred set of ray shooting queries. Particularly, we study ray sets formed by fixing either the direction or the origin of rays. We analyse and discuss the properties of constru...
متن کامل